Irreducible Boolean Functions
نویسنده
چکیده
This paper is a contribution to the study of a quasi-order on the set Ω of Boolean functions, the simple minor quasi-order. We look at the join-irreducible members of the resulting poset˜Ω. Using a two-way correspondence between Boolean functions and hypergraphs, join-irreducibility translates into a combinatorial property of hypergraphs. We observe that among Steiner systems, those which yield join-irreducible members of˜Ω are the −2-monomorphic Steiner systems. We also describe the graphs which correspond to join-irreducible members of˜Ω.
منابع مشابه
Join-Irreducible Boolean Functions
This paper is a contribution to the study of a quasi-order on the set Ω of Boolean functions, the simple minor quasi-order. We look at the join-irreducible members of the resulting poset Ω̃. Using a two-way correspondence between Boolean functions and hypergraphs, join-irreducibility translates into a combinatorial property of hypergraphs. We observe that among Steiner systems, those which yield...
متن کاملA quasi-stability result for low-degree Boolean functions on Sn
We prove that Boolean functions on Sn, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of n whose largest part has size at least n−t, are close to being unions of cosets of stabilizers of t-tuples. We also obtain an edge-isoperimetric inequality for the transposition graph on Sn, which is asymptotically sharp for sets of measure 1/poly(n), usi...
متن کاملEfficient Triadic Generators for Logic Circuits
In practical logic design circuits are built by composing certain types of gates. Each gate itself is a simple circuits with one, two or three inputs and one output, which implements an elementary logic function. These functions are called the generators. For the general purpose the set of generators is considered to be functionally complete, i.e., it is able to express any logic function under...
متن کاملA Heterogeneous Characterization of Subdirectly Irreducible Bijective Boolean Modules
We follow throughout a heterogeneous approach to present some characterizations (Theorem 3.5 and Theorem 3.35) of subdirectly irreducible bijective Boolean modules. The notions of essential element (as modular element) and [1]-closed element (as Boolean element) were implemented to this class of algebras. Our final aim of reaching the class of simple bijective Boolean modules, as a particular c...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کامل